Parallel Voronoi Diagram computation on scaled distance planes using CUDA
نویسندگان
چکیده
Voronoi diagrams are fundamental data structures in computational geometry with several applications on different fields inside and outside computer science. This paper shows a CUDA algorithm to compute Voronoi diagrams on a 2D image where the distance between points cannot be directly computed in the euclidean plane. The proposed method extends an existing Dijkstra-based GPU algorithm to treat our 2D images as graph and then compute the shortest-paths to create each Voronoi cell. Experimental results report speed-ups up to almost 40x over current reference sequential method for Voronoi computation on non-euclidean space. This problem is a building block of the deformation engine in the SOFA physics simulation framework.
منابع مشابه
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and efficient implementation of this algorithm using graphics hardware is possible only with the use of an appropriate shader program on the GPU. This is achieved by rendering in k passes the parallel projection of the top k lev...
متن کاملOptimal Parallel Algorithms for the 3D Euclidean Distance Transform on the CRCW and EREW PRAM Models
In this paper, we develop parallel algorithms for the three-dimensional Euclidean distance transform (3D EDT) on both the CRCW and EREW PRAM computation models. Based on the dimensionality reduction technique and the solution for proximate points problem, we achieve the optimality of the 3D EDT computation. For an N × N × N binary image array, our parallel algorithms for 3D EDT computation are ...
متن کاملA Theoretical Study of Parallel Voronoi Diagram
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log n) parallel algorithm for computing Voronoi diagram on the Euclidean plane. Our technique parallelizes the wellknown seemingly inherent sequential technique of Shamos and Hoey, and makes use of a number of special properties of the div...
متن کاملInteractive Computation of Discrete Generalized Voronoi Diagrams using Range Culling
We present an algorithm for fast computation of discrete generalized Voronoi diagrams. Given a set of geometric primitives, and a distance metric, our algorithm efficiently computes the Voronoi diagram along a uniform grid by evaluating distance fields. We use a multipass approach and divide the computation into intervals along each dimension. We present an efficient culling algorithm to reduce...
متن کاملA simple parallel algorithm for the stepwise approximate computation of Voronoi diagrams of line segments
We present a PRAM algorithm to approximate the Voronoi diagram of line segments for a grid of points in the plane. The algorithm combines ideas from computer graphics and from hierarchical approximation algorithms. We analyze the complexity and report on experimental results of an implementation on a PRAM simulator. The algorithm can be extended to other types of objects and distance metrics. W...
متن کامل